The computational SLR: a logic for reasoning about computational indistinguishability
نویسندگان
چکیده
منابع مشابه
The Computational SLR: A Logic for Reasoning about Computational Indistinguishability
Computational indistinguishability is a notion in complexity-theoretic cryptography and is used to define many security criteria. However, in traditional cryptography, proving computational indistinguishability is usually informal and becomes error-prone when cryptographic constructions are complex. This paper presents a formal proof system based on an extension of Hofmann’s SLR language, which...
متن کاملA Computational Indistinguishability Logic for the Bounded Storage Model
Side-channel attacks are a major threat for cryptographic mechanisms; yet, they are not considered in the computational model that is used by cryptographers for proving the security of their schemes. As a result, there are several efficient attacks against standardized implementations of provably secure schemes. Leakage resilient cryptography aims to extend provable security so that it can acco...
متن کاملA Note on Computational Indistinguishability
-We show that following two conditions are equivalent: 1) The existence of pseudorandom generators. 2) The existence of a pair of efficiently constructible distributions which are computationally indistinguish able but statisticaUy very different.
متن کاملTermination-Insensitive Computational Indistinguishability
We defined a new notion of computational indistinguishability: termination-insensitive computational indistinguishability (tic-indistinguishability). Tic-indistinguishability models indistinguishability with respect to distinguishers that cannot distinguish between termination and non-termination. We sketch how the new notion allows to get computational soundness results of symbolic models for ...
متن کاملComputational Indistinguishability: A Sample Hierarchy
We consider the existence of pairs of probability ensembles which may be efficiently distinguished from each other given k samples but cannot be efficiently distinguished given k0 < k samples. It is well known that in any such pair of ensembles it cannot be that both are efficiently computable (and that such phenomena cannot exist for nonuniform classes of distinguishers, say, polynomial-size c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2010
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129510000265